An Extremal Problem in Interpolation Theory
نویسندگان
چکیده
If z1, z2, . . . , zn are complex numbers in the open unit disk D and A1, A2, . . . , An are N ×N matrices, let F denote the family of analytic functions, bounded in D, such that for each F ∈ F , F (zk) = Ak, k = 1, 2, . . . , n. We consider ρ = infF∈F supz∈D |F (z)|sp where | · |sp denotes the spectral radius. H. Bercovici has raised the question whether this infimum is attained. We will show that the answer is affirmative for N ≤ 3, and we point out at the obstructions to generalize this result to the case N > 3.
منابع مشابه
A Variation on Selberg’s Approximation Problem
Let α ∈ C in the upper half-plane and let I be an interval. We construct an analogue of Selberg’s majorant of the characteristic function of I that vanishes at the point α. The construction is based on the solution to an extremal problem with positivity and interpolation constraints. Moreover, the passage from the auxiliary extremal problem to the construction of Selberg’s function with vanishi...
متن کاملLocating good points for multivariate polynomial approximation
Locating good points for multivariate polynomial approximation, in particular interpolation, is an open challenging problem, even in standard domains. One set of points that is always good, in theory, is the so-called Fekete points. They are defined to be those points that maximize the (absolute value of the) Vandermonde determinant on the given compact set. However, these are known analyticall...
متن کاملExtremal Problems of Interpolation Theory
We consider problems where one seeks m×m matrix valued H∞ functions w(ξ) which satisfy interpolation constraints and a bound (0.1) w∗(ξ)w(ξ) ≤ ρmin, |ξ| < 1, where the m×m positive semi-definite matrix ρmin is minimal (no smaller than) any other matrix ρ producing such a bound. That is, if (0.2) w∗(ξ)w(ξ) ≤ ρ, |ξ| < 1, and if ρmin − ρ is positive semi-definite, then ρmin = ρ. This is an example...
متن کاملUniqueness of Smoothest Interpolants
(1) inf{‖f ‖p : f ∈ C [0, 1], f(ti) = ei, i = 1, . . . , m}, where ‖ · ‖p is the usual L [0, 1] norm, 1 ≤ p ≤ ∞, and to characterize f for which the above infimum is attained. If m ≤ n, then this problem has a simple solution. There are algebraic polynomials of degree at most n−1 satisfying the interpolation data, and any of these polynomials obviously solve our problem. If m > n then, in gener...
متن کاملBest one-sided L1 approximation to the Heaviside and sign functions
We find the polynomials of the best one-sided approximation to the Heaviside and sign functions. The polynomials are obtained by Hermite interpolation at the zeros of some Jacobi polynomials. Also we give an estimate of the error of approximation and characterize the extremal points of the convex set of the best approximants. c ⃝ 2012 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001